منابع مشابه
Efficient generation of fair dice with few biased coins
Given a random variable X which takes n equiprobable values, we consider several algorithmic questions related to the classical problem of simulating the outcomes of X by using a limited number of biased coins. in the framework of the project: \EEcienza di Algoritmi e Progetto di Strutture Informative".
متن کاملJointly Controlled Lotteries with Biased Coins
We provide a mechanism that uses two biased coins and implements any distribution on a finite set of elements, in such a way that even if the outcomes of one of the coins is determined by an adversary, the final distribution remains unchanged. We apply this result to show that every quitting game in which at least two players have at least two continue actions has an undiscounted ε-equilibrium,...
متن کاملOn Fair Exchange, Fair Coins and Fair Sampling
We study various classical secure computation problems in the context of fairness, and relate them with each other. We also systematically study fair sampling problems (i.e., inputless functionalities) and discover three levels of complexity for them. Our results include the following: – Fair exchange cannot be securely reduced to the problem of fair cointossing by an r-round protocol, except w...
متن کاملUsing Biased Coins as Oracles
While it is well known that a Turing machine equipped with the ability to flip a fair coin cannot compute more than a standard Turing machine, we show that this is not true for a biased coin. Indeed, any oracle set X may be coded as a probability pX such that if a Turing machine is given a coin which lands heads with probability pX it can compute any function recursive in X with arbitrarily hig...
متن کاملRandom networks tossing biased coins.
In statistical mechanical investigations of complex networks, it is useful to employ random graph ensembles as null models to compare with experimental realizations. Motivated by transcription networks, we present here a simple way to generate an ensemble of random directed graphs with asymptotically, scale-free out-degree and compact in-degree. Entries in each row of the adjacency matrix are s...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Information and Computation
سال: 1996
ISSN: 0890-5401
DOI: 10.1006/inco.1996.0036